NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
511	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
512	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
513	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 NP-complete problems Graph coloring Edge coloring Independent set Dominating set Combinatorial optimization Search algorithms Maximal independent set Minimum spanning tree Graph theory Theoretical computer science Mathematics
514	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices Ioannis Koutis1 , Alex Levin2 , and Richard Peng3 1 Computer Science Department, University of Puerto Rico, Río Piedras Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2012-02-13 21:14:04 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Minor SL Degree Graph partition Time complexity Theoretical computer science Graph theory Computational complexity theory
515	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
516	Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research, University of Kent Abstract. The program verification tool SLAyer us Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:15 Electronic design automation Formal methods Logic in computer science NP-complete problems Vehicle Identification Number Satisfiability Modulo Theories FO Kripke semantics Theoretical computer science Mathematical logic Logic
517	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
518	When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1 Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2012-06-17 02:27:41 NP-complete problems Cograph Tree decomposition Clique Graph Tree Minor Cycle rank Path decomposition Graph theory Graph operations Graph coloring
519	If you want to help us to build sudoku pages in your language translate text below. Your translation should be placed in the cells marked as (TranslationPlease send us translated form to . Thank Add to Reading List Source URL: sudoku.friko.net Language: English - Date: 2005-11-12 06:35:16 Sudoku NP-complete problems Sudoku algorithms Mathematics of Sudoku Mathematics Logic puzzles Recreational mathematics
520	Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:35:59 NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics

UPDATE